Adjusted Viterbi Training

نویسندگان

  • Jüri Lember
  • Alexey Koloydenko
چکیده

We propose modifications of the Viterbi Training (VT) algorithm to estimate emission parameters in Hidden Markov Models (HMM) which are widely used in speech recognition, natural language modeling, image analysis, and bioinformatics. Our goal is to alleviate the inconsistency of VT while controlling the amount of extra computations. Specifically, we modify VT to enable it asymptotically to fix the true values of the parameters as does the EM algorithm. Our approach relies on infinite Viterbi alignment and an associated with it limiting probability distribution. We focus on mixture models, an important special case of HMM, wherein the limiting distribution can be computed exactly and be used in the adjusted VT algorithm. A simulation experiment shows that our central algorithm (VA1) can dramatically improve accuracy without much cost in computation time. We also propose VA2, a more mathematically advanced correction to VT, verify its fast convergence and high accuracy, and intend to elaborate on its computationally feasible implementations in future work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

m at h . ST ] 1 4 Se p 20 07 Adjusted Viterbi training for hidden Markov models

To estimate the emission parameters in hidden Markov models one commonly uses the EM algorithm or its variation. Our primary motivation, however, is the Philips speech recognition system wherein the EM algorithm is replaced by the Viterbi training algorithm. Viterbi training is faster and computationally less involved than EM, but it is also biased and need not even be consistent. We propose an...

متن کامل

Adjusted Viterbi training for hidden Markov models

We consider estimation of the emission parameters in hidden Markov models. Commonly, one uses the EM algorithm for this purpose. However, our primary motivation is the Philips speech recognition system wherein the EM algorithm is replaced by the Viterbi training algorithm. Viterbi training is faster and computationally less involved than EM, but it is also biased and need not even be consistent...

متن کامل

The adjusted Viterbi training for hidden Markov models

The EM procedure is a principal tool for parameter estimation in the hidden Markov models. However, applications replace EM by Viterbi extraction, or training (VT). VT is computationally less intensive, more stable and has more of an intuitive appeal, but VT estimation is biased and does not satisfy the following fixed point property. Hypothetically, given an infinitely large sample and initial...

متن کامل

Adjusted Viterbi Training. A proof of concept

Viterbi Training (VT) provides a fast but inconsistent estimator of Hidden Markov Models (HMM). The inconsistency is alleviated with little extra computation when we enable VT to asymptotically fix the true values of the parameters. This relies on infinite Viterbi alignments and associated with them limiting probability distributions. First in a sequel, this paper is a proof of concept; it focu...

متن کامل

Comparative Study of the Baum-Welch and Viterbi Training Algorithms Applied to Read and Spontaneous Speech Recognition

In this paper we compare the performance of acoustic HMMs obtained through Viterbi training with that of acoustic HMMs obtained through the Baum-Welch algorithm. We present recognition results for discrete and continuous HMMs, for read and spontaneous speech databases, acquired at 8 and 16 kHz. We also present results for a combination of Viterbi and Baum-Welch training, intended as a trade-off...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004